Robust and Efficient Fully Parallel 2D Thinning Algorithm
نویسندگان
چکیده
منابع مشابه
Improved Low Complexity Fully Parallel Thinning Algorithm
A fully parallel iterative thinning algorithm called MB2 is presented. It favourably competes with the best known algorithms regarding homotopy, mediality; thickness, rotation invariance and noise immunity, while featuring a speed improvement by a factor two or more owing to a smaller number of operations to perform. MB2 is grounded on a simple physics-based thinning principle that conveys both...
متن کاملAn improved fully parallel 3D thinning algorithm
A 3D thinning algorithm erodes a 3D image layer by layer to extract the skeletons. This paper presents an improved fully parallel 3D thinning algorithm which extracts medial lines from a 3D image. This algorithm is based on Ma and Sonka’s thinning algorithm [16], which fails to preserve connectivity of 3D objects. We start with Ma and Sonka’s algorithm and examine its verification of connectivi...
متن کاملA 3D fully parallel surface-thinning algorithm
The thinning is an iterative layer by layer erosion until only the ‘‘skeletons’’ of the objects are left. This paper presents a thinning algorithm for extracting medial surfaces from 3D binary pictures. The strategy which is used is called fully parallel, which means that the same parallel operator is applied at each iteration. An efficient implementation of the proposed algorithm on convention...
متن کاملPattern Reconstructability in Fully Parallel Thinning
It is a challenging topic to perform pattern reconstruction from a unit-width skeleton, which is obtained by a parallel thinning algorithm. The bias skeleton yielded by a fully-parallel thinning algorithm, which usually results from the so-called hidden deletable points, will result in the difficulty of pattern reconstruction. In order to make a fully-parallel thinning algorithm pattern reconst...
متن کاملNote on fifteen 2D parallel thinning algorithms
We present a study of fifteen parallel thinning algorithms, based on the framework of critical kernels. We prove that ten among these fifteen algorithms indeed guarantee topology preservation, and give counter-examples for the five other ones. We also investigate, for some of these algorithms, the relation between the medial axis and the obtained homotopic skeleton.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2014
ISSN: 0975-8887
DOI: 10.5120/14834-3092